Search results for "Optical routing"

showing 1 items of 1 documents

Optical Routing of Uniform Instances in Cayley Graphs

2001

Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.

CombinatoricsDiscrete mathematicsVertex-transitive graphCayley graphChordal graphApplied MathematicsDiscrete Mathematics and CombinatoricsOptical routingAssignment problemGraphMathematicsofComputing_DISCRETEMATHEMATICSMathematicsElectronic Notes in Discrete Mathematics
researchProduct